Compositional Minimization in Span(Graph): Some Examples

CoMeta Project Workshop Preliminary Version Compositional Minimization in Span(Graph): Some Examples

We study a class of examples of minimizing automata with respect to branching bisimulation in the context of the Span(Graph) model. Compositional minimization is particularly efficient for the class which includes the classical dining philospher problem and variants. The reason for the efficiency is that finite subsets of the class generate finite submonoids of the bisimulation monoid. We indic...

Compositional Minimization of Finite State Systems

20 Indeed, a way to obtain interface speciications is by using the property to be veriied as interface speciication. This is what Clarke et al. CLM89] had in mind. However, their approach only exploits the alphabet of the property under consideration. A reened treatment of property constraints using our notion of interface speciication is under investigation. Finally, it should be mentioned tha...

On Some Compositional Petri

This paper continues a research on universal contexts and Petri net semantics started in NPS95]. We regard generalized, labelled Petri nets, N, where some transitions and places are distinguished as`public'. They form the interface of N that may communicate with a Petri net context. An elementary calculus, E, is introduced that allows to construct any Petri net with an interface from trivial co...

Some Examples in Toric Geometry

We present two examples in toric geometry concerning the relationship between smooth toric varieties and quasitoric manifolds (or more generally unitary torus manifolds), and extend the results of [8] to prove the non-existence of almost complex quasitorics over the duals of some certain cyclic 4-polytopes. We also provide the sufficient conditions on the base polytope and the characteristic ma...

Representations : Some Examples